The Rook on the Half - Chessboard , or

نویسندگان

  • Kiran S. Kedlaya
  • Lenhard L. Ng
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Rook on the Half-Chessboard, or How Not to Diagonalize a Matrix

1/i if i + j ≥ n + 1 0 otherwise, has eigenvalues 1,−1/2, 1/3, . . . , (−1)/n. In Section 2, we establish this result in two ways: (1) by explicitly exhibiting eigenvectors via an odd-looking combinatorial identity, and (2) by giving a matrix that conjugates Tn into an upper triangular matrix. In Section 3, we use the knowledge of the eigenvalues of Tn to study two related random walks, most co...

متن کامل

Explicit formula for the generating series of diagonal 3D rook paths

In this article, we solve a problem of enumerative combinatorics addressed and left open in [16]. The initial question is formulated in terms of paths on an infinite three-dimensional chessboard. The 3D chessboard being identified with N, a 3D rook is a piece which is allowed to move parallelly to one of the three axes. The general objective is to count paths (i.e., finite sequences of moves) o...

متن کامل

The rook problem on saw-toothed chessboards

A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j) can dominate the squares in row i and in column j . The rook problem of an STC is to determine the minimum number of rooks that can dominate all squares of the STC. In this paper, we model an STC by two particular gra...

متن کامل

On a dispersion problem in grid labeling

Given k labelings of a finite d-dimensional cubical grid, define the combined distance between two labels to be the sum of the l1-distance between the two labels in each labeling. We want to construct k labelings which maximize the minimum combined distance between any two labels. When d = 1, this can be interpreted as placing n non-attacking rooks in a k-dimensional chessboard of size n in suc...

متن کامل

Pillow Chess

In cylindrical chess, one plays on a regular chessboard with the pieces in their standard positions, but imagines that the left and right edges of the board are identified. So, for example, when a rook travels horizontally off the right-hand edge, it reappears in the same row on the left-hand side of the board. It is easy to make a cylindrical chessboard out of paper, by taping together the lef...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007